[1]Shmoys D B, Tardos E, Aardal K I. Approximation algorithms for facility location problems[C]. In Proceedings of STOC, 1997. 265-274. [2]Li S. A 1. 488-approximation algorithm for the uncapacitated facility location problem[J]. Information and Computation, 2013, 222: 45-58. [3]Guha S, Khuller S. Greedy strike back: improved facility location algorithms[J]. Journal of Algorithms, 1999, 31: 228-248. [4]Chudak F A, Shmoys D B. Improved approximation algorithms for a capacitated facility location problem[C]. In Proceedings of SODA, 1999. 875-876. [5]Jain K, Vazirani V V. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation[J]. Journal of the ACM, 2001, 48: 274-296. [6]Arya V, Garg N, Khandekar R, et al. Local search heuristics for k-median and facility location problems[C]. In Proceedings of STOC, 2001. 21-29. [7]Jain K, Mahdian M, Markakis E, et al. Greedy facility location algorithm analyzed using dual fitting with factor-revealing LP[J]. Journal of the ACM, 2003, 50: 795-824. [8]Mahdian M, Ye Y, Zhang J. Approximation algorithms for metric facility location problems[J]. SIAM Journal on Computing, 2006, 36: 411-432. [9]Mahdian M, Ye Y, Zhang J. A 2-approximation algorithm for the soft capacitated facility location problem[C]. In Proceedings of APPROX 2003 and RANDOM 2003, 2003. 129-140. [10]Daskin M S, Coullard C R, Max Shen Z J. An inventory-location model: formulation, solution algorithm and computational results[J]. Annals of Operations Research, 2002, 110: 83-106. [11]Max Shen Z J, Coullard C R, Daskin M S. A joint location-inventory model[J]. Transportation Science, 2003, 37: 40-55. [12]Shu J, Teo C P, Max Shen Z J. Stochastic transportation-inventory network design problem[J]. Operations Research, 2005, 53: 48-60. [13]Li Y, Shu J, Wang X, et al. Approximation algorithms for integrated distribution network design problems[J]. INFORMS Journal on Computing, 2013, 25: 572-584. |